NuSMV Version 2: BDD-based + SAT-based Symbolic Model Checking

نویسندگان

  • A. Cimatti
  • E. Giunchiglia
  • M. Pistore
  • M. Roveri
  • R. Sebastiani
  • A. Tacchella
چکیده

NUSMV is a symbolic model checker originated from the reengineering, reimplementation and extension of SMV [11], version 2.4.4 (SMV from now on). NUSMV has been designed to be applicable in technology transfer projects: it is a well structured, open, flexible and documented platform for model checking, and is robust and close to industrial systems standards. This paper describes the new version of NUSMV (NUSMV.2 in the following). NUSMV.2 inherits all the functionalities and the implementation style of the previous version [5] (NUSMV.1 in the following). However, NUSMV.2 significantly extends the functionalities of NUSMV.1, and its internal structure departs from the one of NUSMV.1. At the functional level, the main novelty in NUSMV.2 is the integration of model checking techniques based on propositional satisfiability (SAT). Remarkably, the integration covers the whole input language of NUSMV, and is carried out at the source code level. As far as we know, NUSMV.2 is the only publicly available system that allows for both BDD-based and SAT-based model checking. At the architectural level, a major redesign was carried out. In the new version, the functionalities provided by most modules are independent from the actual model checking engine used. Thus, for example, the services provided by the module implementing the cone of influence reduction technique can be applied both in BDD-based and SAT-based model checking. This allowed for the effective integration of the new SAT-based engine and opens up towards the integration of other model checking procedures, like the ones described in [1]. NUSMV.2 is the result of a cooperative project. IRST and the University of Trento carried out the activities related to model checking, while the University of Genova provided a package implementing reduced boolean circuits [1] and the state of the art SIM SAT solver [10]. The SIM solver is particularly effective in tackling problems arising from bounded model checking [7]. NUSMV.2 is available at http://nusmv.irst.itc.it.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Nusmv Version 2 : Bdd − Based + Sat − Based Symbolic

This report has been submitted forr publication outside of ITC and will probably be copyrighted if accepted for publication. It has been issued as a Technical Report forr early dissemination of its contents. In view of the transfert of copy right too the outside publisher, its distribution outside of ITC priorr to publication should be limited to peer communications and specificc requests. Afte...

متن کامل

A Symbolic Model Checking Framework for Hierarchical Systems

BDD-based symbolic model checking is capable of verifying systems with a large number of states. In this work, we report an extensible framework to facilitate symbolic encoding and checking of hierarchical systems. Firstly, a novel library of symbolic encoding functions for compositional operators (e.g., parallel composition, sequential composition, choice operator, etc.) are developed so that ...

متن کامل

An Optimized Symbolic Bounded Model Checking Engine

It has been shown that bounded model checking using a SAT solver can solve many verification problems that would cause BDD based symbolic model checking engines to explode. However, no single algorithmic solution has proven to be totally superior in resolving all types of model checking problems. We present an optimized bounded model checker based on BDDs and describe the advantages and drawbac...

متن کامل

Interpolation and SAT-Based Model Checking

We consider a fully SAT-based method of unbounded symbolic model checking based on computing Craig interpolants. In benchmark studies using a set of large industrial circuit verification instances, this method is greatly more efficient than BDD-based symbolic model checking, and compares favorably to some recent SAT-based model checking methods on positive instances.

متن کامل

Publication I

A compact symbolic encoding is described for the transition relation of systems modeled with asynchronously executing, hierarchical UML state machines that communicate through message passing and attribute access. This enables the analysis of such systems by symbolic model checking techniques, such as BDD-based model checking and SATbased bounded model checking. Message reception, completion ev...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007